Contributed by: Benoît Legat
using SumOfSquares
using DynamicPolynomials
@ncpolyvar x y
p = (x + im * y) * (x - im * y)
import CSDP
model = Model(CSDP.Optimizer)
cone = NonnegPolyInnerCone{MOI.HermitianPositiveSemidefiniteConeTriangle}()
con_ref = @constraint(model, p in cone)
optimize!(model)
sos_decomposition(con_ref, 1e-6)
CSDP 6.2.0 This is a pure primal feasibility problem. Iter: 0 Ap: 0.00e+00 Pobj: 0.0000000e+00 Ad: 0.00e+00 Dobj: 0.0000000e+00 Iter: 1 Ap: 9.00e-01 Pobj: 0.0000000e+00 Ad: 1.00e+00 Dobj: 2.8800000e+01 Iter: 2 Ap: 9.00e-01 Pobj: 0.0000000e+00 Ad: 1.00e+00 Dobj: 5.2897959e+00 Iter: 3 Ap: 1.00e+00 Pobj: 0.0000000e+00 Ad: 1.00e+00 Dobj: 1.0563942e-01
((-1.0000000000000002 - 0.0im)*y + (0.0 - 1.0im)*x)^2
This notebook was generated using Literate.jl.